Discrepancy between Qmc and Rqmc
نویسندگان
چکیده
We introduce a class of functions in d ≥ 3 dimensions which have arbitrary odd superposition effective dimensions between three and d inclusive. We prove that for the integration of any function in this class any Sobol’ points of a fixed length have zero error, whereas Owen’s scrambling of any Sobol’ points of the same length has the same variance of error as simple Monte Carlo methods. Furthermore, for any function in the same class Owen’s scrambling of highdiscrepancy points, which consist of d copies of the van der Corput points in base two, gives zero-variance estimates for the integration. Communicated by Reinhard Winkler Dedicated to Professor Robert F. Tichy on the occasion of his 50th birthday
منابع مشابه
Local Antithetic Sampling with Scrambled Nets
[0,1]d f(x)dx. Monte Carlo (MC) sampling typically attains a root mean squared error (RMSE) of O(n) from n independent random function evaluations. By contrast, quasi-Monte Carlo (QMC) sampling using carefully equispaced evaluation points can attain the rate O(n) for any ε > 0 and randomized QMC (RQMC) can attain the RMSE O(n), both under mild conditions on f . Classical variance reduction meth...
متن کاملMonte Carlo Methods and Path-Generation techniques for Pricing Multi-asset Path-dependent Options
We consider the problem of pricing path-dependent options on a basket of underlying assets using simulations. As an example we develop our studies using Asian options. Asian options are derivative contracts in which the underlying variable is the average price of given assets sampled over a period of time. Due to this structure, Asian options display a lower volatility and are therefore cheaper...
متن کاملSorting methods and convergence rates for Array-RQMC: Some empirical comparisons
We review the Array-RQMC method, its variants, sorting strategies, and convergence results. We are interested in the convergence rate of measures of discrepancy of the states at a given step of the chain, as a function of the sample size n, and also the convergence rate of the variance of the sample average of a (cost) function of the state at a given step, viewed as an estimator of the expecte...
متن کاملProbabilistic error bounds for the discrepancy of mixed sequences
In many applications Monte Carlo (MC) sequences or Quasi-Monte Carlo (QMC) sequences are used for numerical integration. In moderate dimensions the QMC method typically yield better results, but its performance significantly falls off in quality if the dimension increases. One class of randomized QMC sequences, which try to combine the advantages of MC and QMC, are so-called mixed sequences, wh...
متن کاملar X iv : 1 41 2 . 82 93 v 2 [ st at . M L ] 9 A ug 2 01 5 Quasi - Monte Carlo Feature Maps for Shift - Invariant Kernels ∗
We consider the problem of improving the efficiency of randomized Fourier feature maps to accelerate training and testing speed of kernel methods on large datasets. These approximate feature maps arise as Monte Carlo approximations to integral representations of shift-invariant kernel functions (e.g., Gaussian kernel). In this paper, we propose to use Quasi-Monte Carlo (QMC) approximations inst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007